Spatial interpolation in wireless sensor networks: localized algorithms for variogram modeling and Kriging
نویسندگان
چکیده
Wireless sensor networks (WSNs) are rapidly emerging as the prominent technology for monitoring physical phenomena. However, large scale WSNs are known to suffer from coverage holes, i.e., large regions of deployment area where no sensing coverage can be provided. Such holes are the result of hardware failures, extensive costs for redeployment or the hostility of deployment areas. Coverage holes can adversely affect the accurate representation of natural phenomena that are monitored by a WSN. In this work, we propose to exploit the spatial correlation of physical phenomena to make monitoring systems more resilient to coverage holes. We show that a phenomenon can be interpolated inside a coverage hole with a high level of accuracy from the available nodal data given a model of its spatial correlation. However, due to energy limitations of sensor nodes it is imperative to perform this interpolation in an energy efficient manner that minimizes communication among nodes. In this paper, we present highly energy efficient methods for spatial interpolation in WSNs. First, we build a correlation model of the phenomenon being monitored in a distributed manner. Then, a purely localized and distributed spatial interpolation scheme based on Kriging interpolates the phenomenon inside coverage holes. We test the cost and accuracy of our scheme with extensive simulations and show that it is significantly more energy efficient than global interpolations and remarkably more accurate than simple averaging.
منابع مشابه
Ordinary kriging for on-demand average wind interpolation of in-situ wind sensor data
We have developed a domain agnostic ordinary kriging algorithm accessible via a standardsbased service-oriented architecture for sensor networks. We exploit the Open Geospatial Consortium (OGC) Sensor Web Enablement (SWE) standards. We need on-demand interpolation maps so runtime performance is a major priority. Our sensor data comes from wind in-situ observation stations in an area approximate...
متن کاملEstimating and Modeling Space-Time Variograms
Abstract As with a spatial variogram or spatial covariance, a principal purpose of estimating and modeling a space-time variogram is to quantify the spatial temporal dependence reflected in a data set. The resulting model might then be used for spatial interpolation and/or temporal prediction which might take several forms, e.g. kriging and Radial Basis functions. There are significant problems...
متن کاملQuasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملComparing Deterministic and Geostatistical Methods in Spatial Distribution Study of Soil Physical and Chemical Properties in Arid Rangelands (Case Study: Masileh Plain, Qom, Iran)
Accurate knowledge of spatial distribution of soil physical and chemical properties is needed for suitable management and proper use of rangelands in Masileh plain, Qom, Iran. In present study, for the spatial modeling of chemical and physical parameters such as sodium (Na), calcium (Ca), soluble potassium (K), magnesium (Mg), Electrical Conductivity (EC), Saturation Percentage (SP%), silt, cla...
متن کاملMLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- GeoInformatica
دوره 14 شماره
صفحات -
تاریخ انتشار 2010